Private Information Retrieval with Side Information
نویسندگان
چکیده
We study the problem of Private Information Retrieval (PIR) in the presence of prior side information. The problem setup includes a database of K independent messages possibly replicated on several servers, and a user that needs to retrieve one of these messages. In addition, the user has some prior side information in the form of a subset of M messages, not containing the desired message and unknown to the servers. This problem is motivated by practical settings in which the user can obtain side information opportunistically from other users or has previously downloaded some messages using classical PIR schemes. The objective of the user is to retrieve the required message without revealing its identity while minimizing the amount of data downloaded from the servers. We focus on achieving information-theoretic privacy in two scenarios: (i) the user wants to protect jointly its demand and side information; (ii) the user wants to protect only the information about its demand, but not the side information. To highlight the role of side information, we focus first on the case of a single server (single database). In the first scenario, we prove that the minimum download cost is K − M messages, and in the second scenario it is ⌈ K M+1 ⌉ messages, which should be compared to K messages, the minimum download cost in the case of no side information. Then, we extend some of our results to the case of the database replicated on multiple servers. Our proof techniques relate PIR with side information to the index coding problem. We leverage this connection to prove converse results, as well as to design achievability schemes.
منابع مشابه
Private Information Retrieval with Partially Known Private Side Information
We consider the problem of private information retrieval (PIR) of a single message out of K messages from N replicated and non-colluding databases where a cache-enabled user of cache-size M messages possesses side information in the form of full messages that are partially known to the databases. In this model, the user and the databases engage in a two-phase scheme, namely, the prefetching pha...
متن کاملThe Capacity of Private Information Retrieval with Partially Known Private Side Information
We consider the problem of private information retrieval (PIR) of a single message out of K messages from N replicated and non-colluding databases where a cacheenabled user (retriever) of cache-size M possesses side information in the form of full messages that are partially known to the databases. In this model, the user and the databases engage in a two-phase scheme, namely, the prefetching p...
متن کاملThe Capacity of Private Information Retrieval with Private Side Information
The problem of private information retrieval with private side information (PIR-PSI) is recently introduced by Kadhe et al. In this problem, N replicated databases each store K messages, of which M are known to the user as side-information. The identity of these M messages is unknown to the databases. The user wishes to retrieve, as efficiently as possible, a new desired message without reveali...
متن کاملCache-Aided Private Information Retrieval with Partially Known Uncoded Prefetching: Fundamental Limits
We consider the problem of private information retrieval (PIR) from N non-colluding and replicated databases, when the user is equipped with a cache that holds an uncoded fraction r of the symbols from each of the K stored messages in the databases. This model operates in a two-phase scheme, namely, the prefetching phase where the user acquires side information and the retrieval phase where the...
متن کاملSingle Database Private Information Retrieval with Logarithmic Communication
In this paper, we study the problem of single database private information retrieval, and present schemes with only logarithmic server-side communication complexity. Previously the best result could only achieve polylogarithmic communication, and was based on certain less well-studied assumptions in number theory [CMS99]. On the contrary, our construction is based on Paillier’s cryptosystem [P9...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1709.00112 شماره
صفحات -
تاریخ انتشار 2017